An Upper Bound for the Regularity of Ideals of Borel Type

نویسندگان

  • SARFRAZ AHMAD
  • IMRAN ANWAR
چکیده

We show that the regularity of monomial ideals of K[x1, . . . , xn] (K being a field), whose associated prime ideals are totally ordered by inclusion is upper bounded by a linear function in n.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An upper bound for the regularity of powers of edge ideals

‎A recent result due to Ha and Van Tuyl proved that the Castelnuovo-Mumford regularity of the quotient ring $R/I(G)$ is at most matching number of $G$‎, ‎denoted by match$(G)$‎. ‎In this paper‎, ‎we provide a generalization of this result for powers of edge ideals‎. ‎More precisely‎, ‎we show that for every graph $G$ and every $sgeq 1$‎, ‎$${rm reg}( R‎/ ‎I(G)^{s})leq (2s-1) |E(G)|^{s-1} {rm ma...

متن کامل

Castelnuovo-Mumford regularity of products of monomial ideals

Let $R=k[x_1,x_2,cdots, x_N]$ be a polynomial ring over a field $k$. We prove that for any positive integers $m, n$, $text{reg}(I^mJ^nK)leq mtext{reg}(I)+ntext{reg}(J)+text{reg}(K)$ if $I, J, Ksubseteq R$ are three monomial complete intersections ($I$, $J$, $K$ are not necessarily proper ideals of the polynomial ring $R$), and $I, J$ are of the form $(x_{i_1}^{a_1}, x_{i_2}^{a_2}, cdots, x_{i_l...

متن کامل

Binomial edge ideals and rational normal scrolls

‎Let $X=left(‎ ‎begin{array}{llll}‎ ‎ x_1 & ldots & x_{n-1}& x_n\‎ ‎ x_2& ldots & x_n & x_{n+1}‎ ‎end{array}right)$ be the Hankel matrix of size $2times n$ and let $G$ be a closed graph on the vertex set $[n].$ We study the binomial ideal $I_Gsubset K[x_1,ldots,x_{n+1}]$ which is generated by all the $2$-minors of $X$ which correspond to the edges of $G.$ We show that $I_G$ is Cohen-Macaula...

متن کامل

Regularity of second power of edge ideals

Let G be a graph with edge ideal I(G). Benerjee and Nevo proved that for every graph G, the inequality reg(I(G)2)≤reg(I(G))+2 holds. We provide an alternative proof for this result.

متن کامل

A degree bound for the Graver basis of non-saturated lattices

Let $L$ be a lattice in $ZZ^n$ of dimension $m$. We prove that there exist integer constants $D$ and $M$ which are basis-independent such that the total degree of any Graver element of $L$ is not greater than $m(n-m+1)MD$. The case $M=1$ occurs precisely when $L$ is saturated, and in this case the bound is a reformulation of a well-known bound given by several authors. As a corollary, we show t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007